Welcome![Sign In][Sign Up]
Location:
Search - data structure stack

Search list

[Other resource停车场

Description: 我的数据结构的实验题,停车场,用栈和队列 模拟停车场,实现进车和出车-my data structure experiment, a car park, with Stack and Queue simulated car parks, to achieve progress and out of cars
Platform: | Size: 8860 | Author: 胡小勇 | Hits:

[Otherkhss

Description: 数据结构:带括号的算术表达式求值。能完成一位数的带括号的算术表达式的运算,结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-data structure : the bracketed arithmetic expression is evaluated. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack Implementation grade expression and suffixes expression change.
Platform: | Size: 2130 | Author: 橙子 | Hits:

[Other resource表达式求值(大程序)

Description: VC实现的用堆栈实现表达式求值!! 数据结构的一个小作业!! 大家可以参考一下-VC stack with the expression evaluates to achieve! ! Data structure of a small operation! ! We can take a look
Platform: | Size: 43358 | Author: 冰扉 | Hits:

[Otherstack

Description: 数据结构顺序栈的c++实现,闪现基本功能和接口。解压后可直接运行-data structure
Platform: | Size: 12288 | Author: zch | Hits:

[Data structscalculator

Description: 用c语言编写的可以计算整数表达式的计算器,利用了数据结构中的栈-Using c language calculator can calculate the integer expression, the use of the data structure stack
Platform: | Size: 184320 | Author: 乔伊 | Hits:

[Othermaze

Description: a maze program using the data structure stack on c-a maze program using the data structure stack on c++
Platform: | Size: 2048 | Author: chenweicong | Hits:

[Otherstack

Description: 数据结构——进制转化,可以对用户输入的数字进行进制转换-Data structure transformation
Platform: | Size: 188416 | Author: 靳以2002 | Hits:

[AlgorithmStack

Description: 重言式判别,数据结构实验,本人自己的代码,适合初学者使用-Tautology identification, data structure experiment, my own code, suitable for beginners to use
Platform: | Size: 3803136 | Author: zhchwl | Hits:

[Data structsstack

Description: 数据结构栈的演示程序,包括表达式求值,汉诺塔问题,回文判断、走迷宫问题等程序。- The stack data structure demo program, including expression uation, Hanoi problem, and take the program palindrome judgment maze problem etc..
Platform: | Size: 544768 | Author: wx | Hits:

[Process-Threaddata

Description: 实现数据结构栈的删除插入和修改!模拟栈的强大功能-Delete insert and modify the data structure of the stack!!
Platform: | Size: 8192 | Author: Jackvhbc | Hits:

[Linux-UnixStack-and-queue-simple-Test

Description: 实现数据结构中关于栈与队列的基础内容,栈的内容包括顺序栈、链式栈、用栈实现斐波那契函数以及两个栈实现共享空间,队列内容包括顺序队列、链式队列-Implementation of the data structure on the stack and the contents of the queue, the contents of the stack, including the stack, chain stack, with the stack to achieve Fibonacci functions and two stacks to achieve shared space, the queue content, including sequential queue, chain queue
Platform: | Size: 7168 | Author: yang | Hits:

[OtherSTACK

Description: 栈(stack)在计算机科学中是限定仅在表尾进行插入或删除操作的线性表。栈是一种数据结构,它按照后进先出的原则存储数据,先进入的数据被压入栈底,最后的数据在栈顶,需要读数据的时候从栈顶开始弹出数据。栈是只能在某一端插入和删除的特殊线性表。用桶堆积物品,先堆进来的压在底下,随后一件一件往上堆。(Stack (stack) in computer science is limited only in the footer for insertion or deletion operation of linear table.Stack is a data structure that data is stored according to the principle of last in, first out, first to enter the data by the bottom of the stack, the final data at the top of the stack, need to read data from the stack begin to pop up the data.The stack is only at one end special linear table insertion and deletion.An item barrels, heap in under the pressure in the first, then a a pile up.)
Platform: | Size: 6144 | Author: 6Andd7 | Hits:

[Otherstructure

Description: 数据结构中单链表的创建和栈的创建,用C语言实现创建(Data structure in the creation of single-linked list and stack creation, with the C language to achieve the creation)
Platform: | Size: 2048 | Author: Ashley-d | Hits:

[Data structsInFix2PostFixorPreFix

Description: 要求:构建一个表达式树,当输入中缀表达式时,输出并打印其前缀及后缀表达式 实现:构造一个标准的表达式树的类,它涵盖先序、中序、后序遍历操作,通过不同顺序的打印操作来实现转换操作;相对于使用栈来进行转换,免去了中缀转成前缀时进行的逆序操作(Requirements: to construct an expression tree, when the input infix expression, output and print the prefix and suffix expression To achieve: constructing a standard expression tree, it covers the first order, in sequence, after the traversal operation, through the printing operation sequence to achieve the conversion operation; compared with the use of the stack to convert, eliminates the inverse operation of the infix turn into a prefix)
Platform: | Size: 2048 | Author: 舟齐 | Hits:

[Data structsStack

Description: stack c data structure
Platform: | Size: 1024 | Author: Minji | Hits:

[OtherPlayWithDataStructureSourceCode

Description: 数据结构c语言程序示例,包括线性表、栈和队列、串、树、图、查找、排序。(Data structure c language program example.Including linear table, stack and queue, string, tree, graph, search and sort.)
Platform: | Size: 54272 | Author: 东南西北 | Hits:

[Other栈和队列

Description: 大学生数据结构栈和队列作业,题目为:栈和队列的实现与应用(Student data structure stack and queue job, the topic is: stack and queue implementation and Application)
Platform: | Size: 524288 | Author: Lidesi | Hits:

[JSP/Javawordladder

Description: 使用java实现的wordladder 经典的数据结构练习题(classic data structure practice problem implemented in java)
Platform: | Size: 3892224 | Author: aliceli | Hits:

[Windows DevelopOldSnake

Description: 在vs2017中C语言实现贪吃蛇数据结构的初级用法。其中用到了数据结构的栈和队列,要求链表的基本功比较扎实。(In vs2017, C language implements the primary usage of snake data structure. The data structure stack and queue are used, and the basic skills of the linked list are relatively solid.)
Platform: | Size: 2174976 | Author: 丑丑先森 | Hits:

[OtherCode

Description: 7-1 Tree Traversals Again(10 分) An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.(An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.)
Platform: | Size: 57344 | Author: zjuzxm | Hits:
« 1 2 ... 5 6 7 8 9 1011 12 13 14 15 ... 45 »

CodeBus www.codebus.net